منابع مشابه
A supervised manifold learning method
The Locally Linear Embedding (LLE) algorithm is an unsupervised nonlinear dimensionality-reduction method, which reports a low recognition rate in classification because it gives no consideration to the label information of sample distribution. In this paper, a classification method of supervised LLE (SLLE) based on Linear Discriminant Analysis (LDA) is proposed. First, samples are classified a...
متن کاملMulti-Manifold Semi-Supervised Learning
We study semi-supervised learning when the data consists of multiple intersecting manifolds. We give a finite sample analysis to quantify the potential gain of using unlabeled data in this multi-manifold setting. We then propose a semi-supervised learning algorithm that separates different manifolds into decision sets, and performs supervised learning within each set. Our algorithm involves a n...
متن کاملSupervised Manifold Learning for Media Interestingness Prediction
In this paper, we describe the models designed for automatically selecting multimedia data, e.g., image and video segments, which are considered to be interesting for a common viewer. Specifically, we utilize an existing dimensionality reduction method called Neighborhood MinMax Projections (NMMP) to extract the low-dimensional features for predicting the discrete interestingness labels. Meanwh...
متن کاملSupervised Manifold Learning with Incremental Stochastic Embeddings
In this paper, we introduce an incremental dimensionality reduction approach for labeled data. The algorithm incrementally samples in latent space and chooses a solution that minimizes the nearest neighbor classification error taking into account label information. We introduce and compare two optimization approaches to generate supervised embeddings, i.e., an incremental solution construction ...
متن کاملSemi-Supervised Learning with Manifold Fitted Graphs
In this paper, we propose a locality-constrained and sparsity-encouraged manifold fitting approach, aiming at capturing the locally sparse manifold structure into neighborhood graph construction by exploiting a principled optimization model. The proposed model formulates neighborhood graph construction as a sparse coding problem with the locality constraint, therefore achieving simultaneous nei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2009
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis0902205l